CONSTRAINT BASED NLP ENGINE
نویسندگان
چکیده
منابع مشابه
The NLP Engine: A Universal Turing Machine for NLP
It is commonly accepted that machine translation is a more complex task than part of speech tagging. But how much more complex? In this paper we make an attempt to develop a general framework and methodology for computing the informational and/or processing complexity of NLP applications and tasks. We define a universal framework akin to a Turning Machine that attempts to fit (most) NLP tasks i...
متن کاملStatistical Inference and Probabilistic Modeling for Constraint-Based NLP
In this paper we present a probabilistic model for constraint-based grammars and a method for estimating the parameters of such models from incomplete, i.e., unparsed data. Whereas methods exist to estimate the parameters of probabilistic context-free grammars from incomplete data ([2]), so far for probabilistic grammars involving context-dependencies only parameter estimation techniques from c...
متن کاملStatistical Inference and Probabilistic Modelling for Constraint-Based NLP
In this paper we present a probabilistic model for constraint-based grammars and a method for estimating the parameters of such models from incomplete, i.e., unparsed data. Whereas methods exist to estimate the parameters of probabilistic context-free grammars from incomplete data ([2]), so far for probabilistic grammars involving context-dependencies only parameter estimation techniques from c...
متن کاملBE: A Search Engine For NLP Research
Many modern natural language-processing applications utilize search engines to locate large numbers of Web documents or to compute statistics over the Web corpus. Yet Web search engines are designed and optimized for simple human queries—they are not well suited to support such applications. As a result, these applications are forced to issue millions of successive queries resulting in unnecess...
متن کاملThe Adaptive Constraint Engine
The Adaptive Constraint Engine (ACE) seeks to automate the application of constraint programming expertise and the extraction of domain-specific expertise. Under the aegis of FORR, an architecture for learning and problemsolving, ACE learns search-order heuristics from problem solving experience. This paper describes ACE’s approach, as well as new experimental results on specific problem classe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VAWKUM Transactions on Computer Sciences
سال: 2015
ISSN: 2308-8168,2411-6335
DOI: 10.21015/vtcs.v6i2.325